Formalism and intuition in computability.

نویسنده

  • Robert Irving Soare
چکیده

The model of recursive functions in 1934-1936 was a deductive formal system. In 1936, Turing and in 1944, Post introduced more intuitive models of Turing machines and generational systems. When they both died prematurely in 1954, their informal approach was replaced again by the very formal Kleene T-predicate for another decade. By 1965, researchers could no longer read the papers. A second wave of intuition arose with the book by Rogers and Lachlan's revealing papers. A third wave of intuition has arisen from 1996 to the present with a return to the original meaning of computability in the sense of Turing and Gödel, and a return of 'recursive' to its original meaning of 'inductive' and the founding of Computability in Europe by Cooper and others.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Turing’s Approaches to Computability, Mathematical Reasoning and Intelligence

In this paper a distinction is made between Turing’s approach to computability, on the one hand, and his approach to mathematical reasoning and intelligence, on the other hand. Unlike Church’s approach to computability, which is top-down being based on the axiomatic method, Turing’s approach to computability is bottom-up, being based on an analysis of the actions of a human computer. It is argu...

متن کامل

Sequential games and optimal strategies

This article gives an overview of recent work on the theory of selection functions. We explain the intuition behind these higher type objects, and define a general notion of sequential game whose optimal strategies can be computed via a certain product of selection functions. Several instances of this game are considered in a variety of areas such as fixed point theory, topology, game theory, h...

متن کامل

Turing and Post on Computability

[Turing then gives his formal definitions and in particular says that for a real number or function on the natural numbers to be computable it must be computable by amachine that gives an output for every input.] No attempt has yet been made to show that the "computable" numbers include all numbers which would naturally be regarded as computable. All arguments which can be given are bound to be...

متن کامل

Hierarchical Intelligent Mixed Simulation

Intelligence is complementary to faith common name for (intuition, inspiration, imagination) and supposes, at least, {conscience, adaptability, intention). Conscience simulation demands transcending the present limits of computability, by an intensive effort on extensive research to integrate essential mathematical and physical knowledge guided by philosophical goals. A way to begin is hierarch...

متن کامل

A Gamma-based PMQuadtree Specification

The Gamma formalism was proposed to capture the intuition of computation as the global evolution of a collection of atomic values interacting freely. It is formalism for the definition of programs without any artificial sequentiality.. Gamma involves two different kinds of terms: the multisets and the programs. In this paper, we exploit the expressive power of Gamma to specify several variants ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Philosophical transactions. Series A, Mathematical, physical, and engineering sciences

دوره 370 1971  شماره 

صفحات  -

تاریخ انتشار 2012